YES 1.079 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



HASKELL
  ↳ BR

mainModule Main
  ((showList :: [() ->  [Char ->  [Char]) :: [() ->  [Char ->  [Char])

module Main where
  import qualified Prelude



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ BR
HASKELL
      ↳ COR

mainModule Main
  ((showList :: [() ->  [Char ->  [Char]) :: [() ->  [Char ->  [Char])

module Main where
  import qualified Prelude



Cond Reductions:
The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
HASKELL
          ↳ LetRed

mainModule Main
  ((showList :: [() ->  [Char ->  [Char]) :: [() ->  [Char ->  [Char])

module Main where
  import qualified Prelude



Let/Where Reductions:
The bindings of the following Let/Where expression
(showChar '[') . (shows x. showl xs
where 
showl [] = showChar ']'
showl (x : xs) = (showChar ',') . (shows x. showl xs

are unpacked to the following functions on top level
showListShowl [] = showChar ']'
showListShowl (x : xs) = (showChar ',') . (shows x. showListShowl xs



↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
        ↳ HASKELL
          ↳ LetRed
HASKELL
              ↳ NumRed

mainModule Main
  ((showList :: [() ->  [Char ->  [Char]) :: [() ->  [Char ->  [Char])

module Main where
  import qualified Prelude



Num Reduction: All numbers are transformed to thier corresponding representation with Pos, Neg, Succ and Zero.

↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
        ↳ HASKELL
          ↳ LetRed
            ↳ HASKELL
              ↳ NumRed
HASKELL
                  ↳ Narrow

mainModule Main
  (showList :: [() ->  [Char ->  [Char])

module Main where
  import qualified Prelude



Haskell To QDPs


↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
        ↳ HASKELL
          ↳ LetRed
            ↳ HASKELL
              ↳ NumRed
                ↳ HASKELL
                  ↳ Narrow
QDP
                      ↳ QDPSizeChangeProof

Q DP problem:
The TRS P consists of the following rules:

new_pt(vx6, @0, :(vx80, vx81), vx9, ty_@0, ba) → new_pt(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Succ(Zero))))))))))))))))))))))))))))))))))))))))))), vx80, vx81, vx9, ba, ba)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs: